Constructions for Hadamard matrices using Clifford algebras, and their relation to amicability / anti-amicability graphs
نویسندگان
چکیده
It is known that the Williamson construction for Hadamard matrices can be generalized to constructions using sums of tensor products. This paper describes a specific construction using real monomial representations of Clifford algebras, and its connection with graphs of amicability and anti-amicability. It is proven that this construction works for all such representations where the order of the matrices is a power of 2. Some related results are given for small dimensions.
منابع مشابه
Constructions for Hadamard matrices, Clifford algebras, and their relation to amicability / anti-amicability graphs
It is known that the Williamson construction for Hadamard matrices can be generalized to constructions using sums of tensor products. This paper describes a specific construction using real monomial representations of Clifford algebras, and its connection with graphs of amicability and anti-amicability. It is proven that this construction works for all such representations where the order of th...
متن کاملNotes on Weyl–Clifford algebras
Here is discussed generalization of Clifford algebras, l-dimensional Weyl–Clifford algebras T(n, l) with n generators tk satisfying equation ∑n k=1 aktk )l = ∑n k=1 (ak) . It is originated from two basic and well known constructions: representation of Clifford algebras via tensor products of Pauli matrices together with extension for l > 2 using Weyl commutation relations. Presentation of such ...
متن کاملComplex Hadamard Matrices and Combinatorial Structures
Forty years ago, Goethals and Seidel showed that if the adjacency algebra of a strongly regular graph X contains a Hadamard matrix then X is of Latin square type or of negative Latin square type [8]. We extend their result to complex Hadamard matrices and find only three additional families of parameters for which the strongly regular graphs have complex Hadamard matrices in their adjacency alg...
متن کاملClassification of Small Class Association Schemes Coming from Certain Combinatorial Objects Table of Contents
We explore twoor three-class association schemes. We study aspects of the structure of the relation graphs in association schemes which are not easily revealed by their parameters and spectra. The purpose is to develop some combinatorial methods to characterize the graphs and classify the association schemes, and also to delve deeply into several specific classification problems. We work with s...
متن کاملNew Hadamard matrices and conference matrices obtained via Mathon's construction
We give a formulation, via (1, 1) matrices, of Mathon's construction for conference matrices and derive a new family of conference matrices of order 5·92r+1 + 1, t ≥ 0. This family produces a new conference matrix of order 3646 and a new Hadamard matrix of order 7292. In addition we construct new families of Hadamard matrices of orders 6.92r+1+ 2, 10.92t+1 + 2, 8·49·92, t ≥ 0; q2(q + 3) + 2 whe...
متن کامل